Performance analysis of randomised search heuristics operating with a fixed budget
نویسندگان
چکیده
منابع مشابه
Performance analysis of randomised search heuristics operating with a fixed budget
When for a difficult real-world optimisation problem no good problem-specific algorithm is available often randomised search heuristics are used. They are hoped to deliver good solutions in acceptable time. The theoretical analysis usually concentrates on the average time needed to find an optimal or approximately optimal solution. This matches neither the application in practice nor the empiri...
متن کاملAnalysis of Randomised Search Heuristics for Dynamic Optimisation
Dynamic optimisation is an area of application where randomised search heuristics like evolutionary algorithms and artificial immune systems are often successful. The theoretical foundation of this important topic suffers from a lack of a generally accepted analytical framework as well as a lack of widely accepted example problems. This article tackles both problems by discussing necessary cond...
متن کاملA Unified Markov Chain Approach to Analysing Randomised Search Heuristics
The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics. This paper presents a unified Markov chain approach to studying them. Using the approach, the sufficient and necessary conditions of convergence in distribution are established. Then the average convergence rate is introduced to randomised search heuristics and its...
متن کاملA* Search with Inconsistent Heuristics
Early research in heuristic search discovered that using inconsistent heuristics with A* could result in an exponential increase in the number of node expansions. As a result, the use of inconsistent heuristics has largely disappeared from practice. Recently, inconsistent heuristics have been shown to be effective in IDA*, especially when applying the bidirectional pathmax (BPMX) enhancement. T...
متن کاملHigh-Performance A\ast Search Using Rapidly Growing Heuristics
In high-performance A* searching to solve satisfici n g prob lems, there is a c r i t i ca l need to design heur is t ics which cause low t ime-complex i ty . In order for humans or machines to do this effectively, there mus t be an unders tand ing of the domainindependent properties that such heurist ics have. We snow that , contrary to common belief, accuracy is no t c r i t i c a l ; the key...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.06.007